The achromatic number of bounded degree trees
نویسندگان
چکیده
منابع مشابه
Degree Bounded Spanning Trees
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set S ⊆ V(G) of cardinality n(k − 1) + c + 2, there exists a vertex set X ⊆ S of cardinality k such that the degree sum of vertices in X is at least |V(G)| − c − 1. Then G has a spanning tree T with maximum de...
متن کاملSpanning Trees of Bounded Degree
Dirac’s classic theorem asserts that if G is a graph on n vertices, and δ(G) ≥ n/2, then G has a hamilton cycle. As is well known, the proof also shows that if deg(x) + deg(y) ≥ (n− 1), for every pair x, y of independent vertices in G, then G has a hamilton path. More generally, S. Win has shown that if k ≥ 2, G is connected and ∑ x∈I deg(x) ≥ n− 1 whenever I is a k-element independent set, the...
متن کاملDegree-bounded minimum spanning trees
* to be exact, times the weight of a minimum spanning tree (MST). In particular, we present an improved analysis of Chan’s degree-4 MST algorithm [4]. Previous results. Arora [1] and Mitchell [9] presented PTASs for TSP in Euclidean metric, for fixed dimensions. Unfortunately, neither algorithm extends to find degree-3 or degree-4 trees. Recently, Arora and Chang [3] have devised a quasi-polyno...
متن کاملRamsey goodness of bounded degree trees
Given a pair of graphs G and H, the Ramsey number R(G,H) is the smallest N such that every red-blue coloring of the edges of the complete graph KN contains a red copy of G or a blue copy of H. If a graph G is connected, it is well known and easy to show that R(G,H) ≥ (|G| − 1)(χ(H) − 1) + σ(H), where χ(H) is the chromatic number of H and σ(H) is the size of the smallest color class in a χ(H)-co...
متن کاملSpanning Trees of Bounded Degree Graphs
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by d. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of exponential algorithms. The value of interest is the constant βd such that all connected graphs with degree bound ed by d have at least β d spanning trees wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00278-1